Planning multistep error detection and recovery strategies

نویسنده

  • Bruce Randall Donald
چکیده

Robots must plan and execute tasks in the presence of uncertainty. Uncertainty arises from sensing errors, control errors, and the geometry of the environment. By employing a combined strategy offorce and position control, a robot programmer can often guarantee reaching the desired final configuration from all the likely initial configurations. Such motion strategies permit robots to carry out tasks in the presence of significant uncertainty. However, compliant motion strategies are very difficult for humans to specify. For this reason we have been working on the automatic synthesis of motion strategies for robots. In previous work (Donald 1988b; 1989), we presented a framework for computing one-step motion strategies that are guaranteed to succeed in the presence of all three kinds of uncertainty. The motion strategies comprise sensor-based gross motions, compliant motions, and simple pushing motions. However, it is not always possible to find plans that are guaranteed to succeed. For example, if tolerancing errors render an assembly infeasible, the plan executor should stop and signal failure. In such cases the insistence on guaranteed success is too restrictive. For this reason we investigate error detection and recovery (EDR) strategies. EDR plans will succeed or fail recognizably: in these more general strategies, there is no possibility that the plan will fail without the executor realizing it. The EDR framework fills a gap when guaranteed plans cannot be found or do not exist; it provides a technology for constructing plans that might work, but fail in a "reasonable" way when they cannot. We describe techniques for planning multi-step EDR strategies in the presence of uncertainty. Multi-step strategies are considerably more difficult to generate, and we introduce three approaches for their synthesis: these are the Push-forward Algorithm, Failure Mode Analysis, and the Weak EDR Theory. We have implemented the theory in the form of a planner, called LIMITED, in the domain ofplanar assemblies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Geometric Approach to Error Detection and Recovery for Robot Motion Planning with Uncertainty

Robots must plan and execute tasks in the presence of uncertainty. Uncertainty arises from sensing errors, control errors, and uncertainty in the geometric models o f the environment and o f the robot. The last, which we will call model uncertainty, has received little previous attention. In this paper we present a formal framework for computing motion strategies which are guaranteed to succeed...

متن کامل

Algorithmica issue of Algorithmic Foundations of RoboticsVisibility - Based Planning of Sensor Control Strategies

We consider the problem of planning sensor control strategies that enable a sensor to be automatically conngured for robot tasks. In this paper we present robust and eecient algorithms for computing the regions from which a sensor has unobstructed or partially obstructed views of a target in a goal. We apply these algorithms to the Error Detection and Recovery problem of recognizing whether a g...

متن کامل

Sensor Connguration for Error Detection and Recovery

Much of the early work in robotics focused on developing guaranteed plans for accomplishing tasks speciied at a high level. Such task speciications might be of the form \mesh these two gears", or \place part A inside region B". It is not always possible, however, especially in the realm of assembly planning, to generate guaranteed plans. For example, errors in tolerancing of the parts might ren...

متن کامل

Visibility-Based Planning of Sensor Control Strategies1

We consider the problem of planning sensor control strategies that enable a sensor to be automatically configured for robot tasks. In this paper we present robust and efficient algorithms for computing the regions from which a sensor has unobstructed or partially obstructed views of a target in a goal. We apply these algorithms to the Error Detection and Recovery problem of recognizing whether ...

متن کامل

Robust Geometric Algorithms for Sensor Planning

We consider the problem of planning sensor strategies that enable a sensor to be automatically con gured for robot tasks. In this paper we present robust and e cient algorithms for computing the regions from which a sensor has unobstructed or partially obstructed views of a target in a goal. We apply these algorithms to the Error Detection and Recovery problem of recognizing whether a goal or f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Robotics Res.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1988